Computing gradient-based stepwise benchmarking paths
نویسندگان
چکیده
منابع مشابه
Dependability Benchmarking of Computing Systems
A Black-Box Approach to Dependability Benchmarking of Computer Hardware Examples of silent data corruption (SDC), induced by intermittent faults, are given. Two techniques, based on environmental tests, are used to detect SDC: an operating temperature and voltage test, and an electrostatic discharge test. Systems under evaluation execute a Linpack benchmark, which checks correctness of the calc...
متن کاملComputing Tutte Paths
Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps hinder to bound the running time to a polynomial. For special cases however, computational results of Tutte paths are known: For 4-connected plana...
متن کاملAn ELECTRE-based decision aid tool for stepwise benchmarking: An application over EU Digital Agenda targets
a r t i c l e i n f o The study offers a decision support tool for stepwise benchmarking. Within a benchmarking exercise, we propose a method for selecting a preferable development path that consists of a sequence of intermediate benchmarks. First, an outranking multi-criteria approach is used to establish the hierarchical position of benchmarking units. For each unit, we evaluate possible deve...
متن کاملIntegrated Approach to Construction of Benchmarking Network in DEA-Based Stepwise Benchmark Target Selection
Stepwise benchmark target selection in data envelopment analysis (DEA) is a realistic and effective method by which inefficient decision-making units (DMUs) can choose benchmarks in a stepwise manner. We propose, for the construction of a benchmarking network (i.e., a network structure consisting of an alternative sequence of benchmark targets), an approach that integrates the cross-efficiency ...
متن کاملComputing Homotopic Shortest Paths Efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in linear time using the “funnel” algorithm of Chazelle [3] and Lee and Preparata [10]. A more general problem is to find a shortest path between two points in a polygonal domain. In this case the “rubber band” solution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2018
ISSN: 0305-0483
DOI: 10.1016/j.omega.2017.11.002